Message digest instructions

ABSTRACT

A method, system and computer program product for digesting data in storage of a computing environment. The digesting computes a condensed representation of a message or data stored in the computer storage. A COMPUTE INTERMEDIATE MESSAGE DIGEST (KIMD) and a COMPUTE LAST MESSAGE DIGEST (KLMD) instruction are disclosed which specify a unit of storage to be digested by a secure hashing algorithm.

BACKGROUND OF THE INVENTION

[0001] This invention relates to computer system architecture and particularly to new instructions which augment the IBM z/Architecture and can be emulated by other architectures.

[0002] Before our invention IBM has created through the work of many highly talented engineers beginning with machines known as the IBM System 360 in the 1960s to the present, a special architecture which, because of its essential nature to a computing system, became known as “the mainframe” whose principles of operation state the architecture of the machine by describing the instructions which may be executed upon the “mainframe” implementation of the instructions which had been invented by IBM inventors and adopted, because of their significant contribution to improving the state of the computing machine represented by “the mainframe”, as significant contributions by inclusion in IBM's Principles of Operation as stated over the years. The First Edition of the z/Architecture Principles of Operation which was published December, 2000 has become the standard published reference as SA22-7832-00.

[0003] We determined that further new instructions would assist the art and could be included in a z/Architecture machine and also emulated by others in simpler machines, as described herein.

BRIEF SUMMARY OF THE INVENTION

[0004] It is a primary object of the present invention to disclose CPU-synchronous, problem-state, and sectioning instructions which digest data in computer storage wherein the instructions compute a condensed representation of messages or data.

[0005] It is another object of the invention to disclose instructions which specify a unit of storage to be digested, and wherein a secure hashing algorithm digests the data in the specified unit of storage.

[0006] It is another object of the invention to disclose a COMPUTE INTERMEDIATE MESSAGE DIGEST instruction and a COMPUTE LAST MESSAGE DIGEST instruction.

[0007] It is a further object of the invention to disclose a digest instruction wherein complete blocks of data are processed, and after processing all complete blocks, a padding operation is performed to include the remaining portion of the specified storage.

[0008] It is another object of the invention to emulate the digest instruction in a computer architecture which is different than the computer architecture of the instruction.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWING

[0009] These and other objects will be apparent to one skilled in the art from the following detailed description of the invention taken in conjunction with the accompanying drawings in which:

[0010]FIG. 1 is representation of the Compute Intermediate Message Digest (KIMD) instruction in the RRE instruction format;

[0011]FIG. 2 is a representation of the Compute Last Message Digest (KLMD) instruction in the RRE instruction format;

[0012]FIG. 3 is a table showing the function codes of the KIMD instruction of FIG. 1;

[0013]FIG. 4 is a table showing the function codes of the KLMD instruction of FIG. 2;

[0014]FIG. 5 representation of the general register assignment for the KIMD and KLMD instructions of FIGS. 1 and 2;

[0015]FIG. 6 illustrates the symbol for SHA-1 Block Digest Algorithm;

[0016]FIG. 7 illustrates the format of the parameter block for KIMD-Query;

[0017]FIG. 8 illustrates the format of the parameter block for KIMD-SHA-1;

[0018]FIG. 9 illustrates the KIMD-SHA-1 operation;

[0019]FIG. 10 illustrates the format for the parameter block for KLMD-Query;

[0020]FIG. 11 illustrates the format for the parameter block for KLMD-SHA-1;

[0021]FIG. 12 illustrates KLMD-SHA-1 Full Block operation;

[0022]FIG. 13 illustrates the KLMD-SHA-1 Empty Block operation;

[0023]FIG. 14 illustrates the KLMD-SHA-1 Partial-Block Case 1 operation;

[0024]FIG. 15 illustrates the KLMD-SHA-1 Partial-Block Case 2 operation;

[0025]FIG. 16 is a table showing the priority of execution of the KIMD and KLMD instructions;

[0026]FIG. 17 illustrates our cryptographic coprocessor; and

[0027]FIG. 18 shows the generalized preferred embodiment of a computer memory storage containing instructions in accordance with the preferred embodiment and data, as well as the mechanism for fetching, decoding and executing these instructions, either on a computer system employing these architected instructions or as used in emulation of our architected instructions.

DETAILED DESCRIPTION OF THE INVENTION

[0028] The message digest instructions discussed herein are for computing a condensed representation of a message or data file. The compute intermediate message digest and the compute last message digest instructions will first be discussed, followed by a discussion of the preferred computer system for executing these instructions. In the alternative, a second preferred computer system which emulates another computer system for executing these instructions will be discussed.

[0029] Compute Intermediate Message Digest (KIMD)

[0030]FIG. 1 is representation of the Compute Intermediate Message Digest (KIMD) instruction in the RRE instruction format.

[0031] Compute Last Message Digest (KLMD)

[0032]FIG. 2 is a representation of the Compute Last Message Digest (KLMD) instruction in the RRE instruction format;

[0033] A function specified by the function code in general register 0 is performed.

[0034] Bits 16-23 of the instruction and the R1 field are ignored.

[0035] Bit positions 57-63 of general register 0 contain the function code. FIGS. 3 and 4 show the assigned function codes for COMPUTE INTERMEDIATE MESSAGE DIGEST and COMPUTE LAST MESSAGE DIGEST, respectively. All other function codes are unassigned. Bit 56 of general register 0 must be zero; otherwise, a specification exception is recognized. All other bits of general register 0 are ignored. General register 1 contains the logical address of the leftmost byte of the parameter block in storage. In the 24-bit addressing mode, the contents of bit positions 40-63 of general register 1 constitute the address, and the contents of bit positions 0-39 are ignored. In the 31-bit addressing mode, the contents of bit positions 33-63 of general register 1 constitute the address, and the contents of bit positions 0-32 are ignored. In the 64-bit addressing mode, the contents of bit positions 0-63 of general register 1 constitute the address.

[0036] The function codes for COMPUTE INTERMEDIATE MESSAGE DIGEST are shown in FIG. 3.

[0037] The function codes for COMPUTE LAST MESSAGE DIGEST are shown in FIG. 4.

[0038] All other function codes are unassigned.

[0039] The query function provides the means of indicating the availability of the other functions. The contents of general registers R2 and R2+1 are ignored for the query function.

[0040] For all other functions, the second operand is processed as specified by the function code using an initial chaining value in the parameter block, and the result replaces the chaining value. For COMPUTE LAST MESSAGE DIGEST, the operation also uses a message bit length in the parameter block. The operation proceeds until the end of the second-operand location is reached or a CPU-determined number of bytes have been processed, whichever occurs first. The result is indicated in the condition code.

[0041] The R2 field designates an even-odd pair of general registers and must designate an even numbered register; otherwise, a specification exception is recognized.

[0042] The location of the leftmost byte of the second operand is specified by the contents of the R2 general register. The number of bytes in the second-operand location is specified in general register R2+1.

[0043] As part of the operation, the address in general register R2 is incremented by the number of bytes processed from the second operand, and the length in general register R2+1 is decremented by the same number. The formation and updating of the address and length is dependent on the addressing mode.

[0044] In the 24-bit addressing mode, the contents of bit positions 40-63 of general register R2 constitute the address of second operand, and the contents of bit positions 0-39 are ignored; bits 40-63 of the updated address replace the corresponding bits in general register R2, carries out of bit position 40 of the updated address are ignored, and the contents of bit positions 32-39 of general register R2 are set to zeros. In the 31-bit addressing mode, the contents of bit positions 33-63 of general register R_ constitute the address of second operand, and the contents of bit positions 0-32 are ignored; bits 33-63 of the updated address replace the corresponding bits in general register R2, carries out of bit position 33 of the updated address are ignored, and the content of bit position 32 of general register R2 is set to zero. In the 64-bit addressing mode, the contents of bit positions 0-63 of general register R2 constitute the address of second operand; bits 0-63 of the updated address replace the contents of general register R_ and carries out of bit position 0 are ignored.

[0045] In both the 24-bit and the 31-bit addressing modes, the contents of bit positions 32-63 of general register R2+1 form a 32-bit unsigned binary integer which specifies the number of bytes in the second operand; and the updated value replaces the contents of bit positions 32-63 of general register R2+1. In the 64-bit addressing mode, the contents of bit positions 0-63 of general register R2+1 form a 64-bit unsigned binary integer which specifies the number of bytes in the second operand; and the updated value replaces the contents of general register R2+1.

[0046] In the 24-bit or 31-bit addressing mode, the contents of bit positions 0-31 of general registers R2 and R2+1, always remain unchanged.

[0047]FIG. 5 shows the contents of the general registers just described.

[0048] In the access-register mode, access registers 1 and R2 specify the address spaces containing the parameter block and second operand, respectively.

[0049] The result is obtained as if processing starts at the left end of the second operand and proceeds to the right, block by block. The operation is ended when all source bytes in the second operand have been processed (called normal completion), or when a CPU-determined number of blocks that is less than the length of the second operand have been processed (called partial completion). The CPU-determined number of blocks depends on the model, and may be a different number each time the instruction is executed. The CPU-determined number of blocks is usually nonzero. In certain unusual situations, this number may be zero, and condition code 3 may be set with no progress. However, the CPU protects against endless reoccurrence of this no-progress case.

[0050] When the chaining-value field overlaps any portion of the second operand, the result in the chaining value field is unpredictable.

[0051] For COMPUTE INTERMEDIATE MESSAGE DIGEST, normal completion occurs when the number of bytes in the second operand as specified in general register R2+1 have been processed. For COMPUTE LAST MESSAGE DIGEST, after all bytes in the second operand as specified in general register R2+1 have been processed, the padding operation is performed, and then normal completion occurs.

[0052] When the operation ends due to normal completion, condition code 0 is set and the resulting value in R2+1 is zero. When the operation ends due to partial completion, condition code 3 is set and the resulting value in R2+1 is nonzero.

[0053] When the second-operand length is initially zero, the second operand is not accessed, general registers R2 and R2+1 are not changed, and condition code 0 is set. For COMPUTE INTERMEDIATE MESSAGE DIGEST, the parameter block is not accessed. However, for COMPUTE LAST MESSAGE DIGEST, the empty block (L=0) case padding operation is performed and the result is stored into the parameter block.

[0054] As observed by other CPUs and channel programs, references to the parameter block and storage operands may be multiple-access references, accesses to these storage locations are not necessarily block-concurrent, and the sequence of these accesses or references is undefined.

[0055] Access exceptions may be reported for a larger portion of the second operand than is processed in a single execution of the instruction; however, access exceptions are not recognized for locations beyond the length of the second operand nor for locations more than 4K bytes beyond the current location being processed.

[0056] Symbols Used in Function Descriptions

[0057] The symbols of FIG. 6 are used in the subsequent description of the COMPUTE INTERMEDIATE MESSAGE DIGEST and COMPUTE LAST MESSAGE DIGEST functions. Further description of the secure hash algorithm may be found in Secure Hash Standard, Federal Information Processing Standards publication 180-1, National Institute of Standards and Technology, Washington D.C., Apr. 17, 1995.

[0058] KIMD-Query (KIMD Function Code 0)

[0059] The locations of the operands and addresses used by the instruction are as shown in FIG. 5.

[0060] The KIMD-Query parameter block has the format shown in FIG. 7.

[0061] A 128-bit status word is stored in the parameter block. Bits 0-127 of this field correspond to function codes 0-127, respectively, of the COMPUTE INTERMEDIATE MESSAGE DIGEST instruction. When a bit is one, the corresponding function is installed; otherwise, the function is not installed.

[0062] Condition code 0 is set when execution of the KIMD-Query function completes; condition code 3 is not applicable to this function.

[0063] KIMD-SHA-1 (KIMD Function Code 1)

[0064] The locations of the operands and addresses used by the instruction are as shown in FIG. 5.

[0065] The parameter block used for the KIMD-SHA-1 function has the format shown in FIG. 8.

[0066] A 20-byte intermediate message digest is generated for the 64-byte message blocks in operand 2 using the SHA-1 block digest algorithm with the 20-byte chaining value in the parameter block. The generated intermediate message digest, also called the output chaining value (OCV), is stored in the chaining-value field of the parameter block. The KIMD-SHA-1 operation is shown in FIG. 9.

[0067] KLMD-Query (KLMD Function Code 0)

[0068] The locations of the operands and addresses used by the instruction are as shown in FIG. 5.

[0069] The parameter block used for the KLMD-Query function has the format shown in FIG. 10.

[0070] A 128-bit status word is stored in the parameter block. Bits 0-127 of this field correspond to function codes 0-127, respectively, of the COMPUTE LAST MESSAGE DIGEST instruction. When a bit is one, the corresponding function is installed; otherwise, the function is not installed.

[0071] Condition code 0 is set when execution of the KLMD-Query function completes; condition code 3 is not applicable to this function.

[0072] KLMD-SHA-1 (KLMD Function Code 1)

[0073] The locations of the operands and addresses used by the instruction are as shown in FIG. 5.

[0074] The parameter block used for the KLMD-SHA-1 function has the format shown in FIG. 11.

[0075] The message digest for the message (M) in operand 2 is generated using the SHA-1 algorithm with the chaining value and message-bit-length information in the parameter block.

[0076] If the length of the message in operand 2 is equal to or greater than 64 bytes, an intermediate message digest is generated for each 64-byte message block using the SHA-1 block digest algorithm with the 20-byte chaining value in the parameter block, and the generated intermediate message digest, also called the output chaining value (OCV), is stored into the chaining-value field of the parameter block. This operation is shown in FIG. 12 and repeats until the remaining message is less than 64 bytes. If the length of the message or the remaining message is zero bytes, then the operation in FIG. 13 is performed.

[0077] If the length of the message or the remaining message is between one byte and 55 bytes inclusive, then the operation in FIG. 14 is performed; if the length is between 56 bytes and 63 bytes inclusive, then the operation in FIG. 15 is performed; The message digest, also called the output chaining value (OCV), is stored into the chaining-value field of the parameter block.

[0078] Additional Symbols Used in KLMD Functions

[0079] The following additional symbols are used in the description of the COMPUTE LAST MESSAGE DIGEST functions.

[0080] Symbol Explanation for KLMD Function Figures

[0081] L Byte length of operand 2 in storage.

[0082] p <n> n padding bytes; leftmost byte is 80 hex; all other bytes are 00 hex.

[0083] z <56> 56 padding bytes of zero.

[0084] Mb1 an 8-byte value specifying the bit length of the total message.

[0085] q <64> a padding block, consisting of 56 bytes of zero followed by an 8-byte mb1.

[0086] Special Conditions for KIMD and KLMD

[0087] A specification exception is recognized and no other action is taken if any of the following occurs:

[0088] 1. Bit 56 of general register 0 is not zero.

[0089] 2. Bits 57-63 of general register 0 specify an unassigned or uninstalled function code.

[0090] 3. The R2 field designates an odd-numbered register or general register 0.

[0091] 4. For COMPUTE INTERMEDIATE MESSAGE DIGEST, the second-operand length is not a multiple of the data block size of the designated function (see FIG. 3 to determine the data block sizes for COMPUTE INTERMEDIATE MESSAGE DIGEST functions). This specification-exception condition does not apply to the query function, nor does it apply to COMPUTE LAST MESSAGE DIGEST.

[0092] Resulting Condition Code:

[0093] 0 Normal completion

[0094] 1 - -

[0095] 2 - -

[0096] 3 Partial completion

[0097] Program Exceptions:

[0098] Access (fetch, operand 2 and message bit length; fetch and store, chaining value)

[0099] Operation (if the message-security assist is not installed)

[0100] Specification

[0101] Programming Notes:

[0102] 1. Bit 56 of general register 0 is reserved for future extension and should be set to zero.

[0103] 2. When condition code 3 is set, the second operand address and length in general registers R2 and R2+1, respectively, and the chaining-value in the parameter block are usually updated such that the program can simply branch back to the instruction to continue the operation.

[0104] For unusual situations, the CPU protects against endless reoccurrence for the no-progress case. Thus, the program can safely branch back to the instruction whenever condition code 3 is set with no exposure to an endless loop.

[0105] 3. If the length of the second operand is nonzero initially and condition code 0 is set, the registers are updated in the same manner as for condition code 3; the chaining value in this case is such that additional operands can be processed as if they were part of the same chain.

[0106] 4. The instructions COMPUTE INTERMEDIATE MESSAGE DIGEST and COMPUTE LAST MESSAGE DIGEST are designed to be used by a security service application programming interface (API). These APIs provide the program with means to compute the digest of messages of almost unlimited size, including those too large to fit in storage all at once. This is accomplished by permitting the program to pass the message to the API in parts. The following programming notes are described in terms of these APIs.

[0107] 5. Before processing the first part of a message, the program must set the initial values for the chaining-value field. For SHA-1, the initial chaining values are listed as follows:

[0108] H0=x‘6745 2301’

[0109] H1=x‘EFCD AB89’

[0110] H2=x‘98BA DCFE’

[0111] H3=x‘1032 5476’

[0112] H4=x‘C3D2 E1F0’

[0113] 6. When processing message parts other than the last, the program must process message parts in multiples of 512 bits (64 bytes) and use the COMPUTE INTERMEDIATE MESSAGE DIGEST instruction.

[0114] 7. When processing the last message part, the program must compute the length of the original message in bits and place this 64-bit value in the message-bit-length field of the parameter block, and use the COMPUTE LAST MESSAGE DIGEST instruction.

[0115] 8. The COMPUTE LAST MESSAGE DIGEST instruction does not require the second operand to be a multiple of the block size. It first processes complete blocks, and may set condition code 3 before processing all blocks. After processing all complete blocks, it then performs the padding operation including the remaining portion of the second operand. This may require one or two iterations of the SHA-1 block digest algorithm.

[0116] 9. The COMPUTE LAST MESSAGE DIGEST instruction provides the SHA-1 padding for messages that are a multiple of eight bits in length. If SHA-1 is to be applied to a bit string which is not a multiple of eight bits, the program must perform the padding and use the COMPUTE INTERMEDIATE MESSAGE DIGEST instruction.

[0117] Crypto Coprocessor:

[0118] The preferred embodiment provides a crypto coprocessor which can be used with the instructions described herein and to execute cipher messages and assist in a variety of chaining message tasks which can be employed for chained and cryptographic use with the appropriate instructions.

[0119]FIG. 17 illustrates our cryptographic coprocessor which is directly attached to a data path common to all internal execution units on the general purpose microprocessor, which has multiple execution pipelines. The microprocessor internal bus (1) is common to all other execution units is attached to the cryptographic control unit (2), and the control unit watches the bus for processor instructions that it should execute.

[0120] The cryptographic control unit provides a cryptographic coprocessor directly attached to a data path common to all internal execution units of the central processing unit on a general purpose microprocessor providing the available hardware (E₀ . . . E_(n)), or from a combination thereof in the preferred embodiment having multiple execution pipelines) for the central processing unit. When a cryptographic instruction is encountered in the command register (3), the control unit (2) invokes the appropriate algorithm from the available hardware. Operand data is delivered over the same internal microprocessor bus via an input FIFO register (4). When an operation is completed the a flag is set in a status register (6) and the results are available to be read out from the output FIFO register (5).

[0121] The illustrated preferred embodiment of our invention is designed to be extensible to include as many hardware engines as required by a particular implementation depending on the performance goals of the system. The data paths to the input and output registers (7) are common among all engines.

[0122] The preferred embodiment of the invention cryptographic functions are implemented in execution unit hardware on the CPU and this implementation enables a lower latency for calling and executing encryption operations and increases the efficiency.

[0123] This decreased latency greatly enhances the capability of general purpose processors in systems that frequently do many encryption operations, particularly when only small amounts of data are involved. This allows an implementation that can significantly accelerate the processes involved in doing secure online transactions. The most common methods of securing online transactions involve a set of three algorithms. The first algorithm is only used one time in a session, and may be implemented in hardware or software, while the other operations are invoked with every transaction of the session, and the cost in latency of calling external hardware as well as the cost in time to execute the algorithm in software are both eliminated with this invention.

[0124] In FIG. 18 we have shown conceptually how to implement what we have in a preferred embodiment implemented in a mainframe computer having the microprocessor described above which can effectively be used, as we have experimentally proven within IBM, in a commercial implementation of the long displacement facility computer architected instruction format the instructions are used by programmers, usually today “C” programmers. These instruction formats stored in the storage medium may be executed natively in a z/Architecture IBM Server, or alternatively in machines executing other architectures. They can be emulated in the existing and in future IBM mainframe servers and on other machines of IBM (e.g. pSeries Servers and xSeries Servers). They can be executed in machines running Linux on a wide variety of machines using hardware manufactured by IBM, Intel, AMD, Sun Microsystems and others. Besides execution on that hardware under a z/Architecture, Linux can be used as well as machines which use emulation by Hercules, UMX, FXI or Platform Solutions, where generally execution is in an emulation mode. In emulation mode the specific instruction being emulated is decoded, and a subroutine built to implement the individual instruction, as in a “C” subroutine or driver, or some other method of providing a driver for the specific hardware as is within the skill of those in the art after understanding the description of the preferred embodiment. Various software and hardware emulation patents including, but not limited to U.S. Pat. No. 5,551,013 for a “Multiprocessor for hardware emulation” of Beausoleil et al., and U.S. Pat. No. 6,009,261: Preprocessing of stored target routines for emulating incompatible instructions on a target processor” of Scalzi et al; and U.S. Pat. No. 5,574,873: Decoding guest instruction to directly access emulation routines that emulate the guest instructions, of Davidian et al; U.S. Pat. No. 6,308,255: Symmetrical multiprocessing bus and chipset used for coprocessor support allowing non-native code to run in a system, of Gorishek et al; and U.S. Pat. No. 6,463,582: Dynamic optimizing object code translator for architecture emulation and dynamic optimizing object code translation method of Lethin et al; and U.S. Pat. No. 5,790,825: Method for emulating guest instructions on a host computer through dynamic recompilation of host instructions of Eric Traut; and many others, illustrate the a variety of known ways to achieve emulation of an instruction format architected for a different machine for a target machine available to those skilled in the art, as well as those commercial software techniques used by those referenced above.

[0125] In the preferred embodiment the existing pre-long displacement instruction formats for a non superscalar instruction form the operand storage address by the summing of the base register and 12 bit unsigned displacement or the base register, the index register, and the 12 bit unsigned displacement and the new long displacement instruction formats form the operand storage address by the summing of the base register and the 20 bit signed displacement or the base register, the index register, and the 20 bit signed displacement.

[0126] As illustrated by FIG. 18, these instructions are executed in hardware by a processor or by emulation of said instruction set by software executing on a computer having a different native instruction set.

[0127] In FIG. 18, #501 shows a computer memory storage containing instructions and data. The long displacement instructions described in this invention would initially stored in this computer. #502 shows a mechanism for fetching instructions from a computer memory and may also contain local buffering of these instructions it has fetched. Then the raw instructions are transferred to an instruction decoder, #503, where it determines what type of instruction has been fetched. #504, shows a mechanism for executing instructions. This may include loading data into a register from memory, #501, storing data back to memory from a register, or performing some type of arithmetic or logical operation. This exact type of operation to be performed has been previously determined by the instruction decoder. The long displacement instructions described in this invention would be executed here. If the long displacement instructions are being executed natively on a computer system, then this diagram is complete as described above. However, if an instruction set architecture, containing long displacement instructions, is being emulated on another computer, the above process would be implemented in software on a host computer, #505. In this case, the above stated mechanisms would typically be implemented as one or more software subroutines within the emulator software. In both cases an instruction is fetched, decoded and executed.

[0128] More particularly, these architected instructions can be used with a computer architecture with existing instruction formats with a 12 bit unsigned displacement used to form the operand storage address and also one having additional instruction formats that provide a additional displacement bits, preferably 20 bits, which comprise an extended signed displacement used to form the operand storage address. These computer architected instructions comprise computer software, stored in a computer storage medium, for producing the code running of the processor utilizing the computer software, and comprising the instruction code for use by a compiler or emulator/interpreter which is stored in a computer storage medium 501, and wherein the first part of the instruction code comprises an operation code which specified the operation to be performed and a second part which designates the operands for that participate. The long displacement instructions permit additional addresses to be directly addressed with the use of the long displacement facility instruction.

[0129] As illustrated by FIG. 18, these instructions are executed in hardware by a processor or by emulation of said instruction set by software executing on a computer having a different native instruction set.

[0130] In accordance with the computer architecture of the preferred embodiment the displacement field is defined as being in two parts, the least significant part being 12 bits called the DL, DL1 for operand 1 or DL2 for operand 2, and the most significant part being 8 bits called the DH, DH1 for operand 1 or DH2 for operand 2.

[0131] Furthermore, the preferred computer architecture has an instruction format such that the opcode is in bit positions 0 through 7 and 40 through 47, a target register called R1 in bit positions 8 through 11, an index register called X2 in bit positions 12 through 15, a base register called B2 in bit positions 16 through 19, a displacement composed of two parts with the first part called DL2 in bit positions 20 through 31 and the second part called DH2 in bit positions 32 through 39.

[0132] This computer architecture has an instruction format such that the opcode is in bit positions 0 through 7 and 40 through 47, a target register called R1 in bit positions 8 through 11, an source register called R3 in bit positions 12 through 15, a base register called B2 in bit positions 16 through 19, a displacement composed of two parts with the first part called DL2 in bit positions 20 through 31 and the second part called DH2 in bit positions 32 through 39.

[0133] Furthermore, our computer architecture instructions having a long displacement facility has an instruction format such that the opcode is in bit positions 0 through 7 and 40 through 47, a target register called R1 in bit positions 8 through 11, a mask value called M3 in bit positions 12 through 15, a base register called B2 in bit positions 16 through 19, a displacement composed of two parts with the first part called DL2 in bit positions 20 through 31 and the second part called DH2 in bit positions 32 through 39.

[0134] As illustrated, our preferred computer architecture with its long displacement facility has an instruction format such that the opcode is in bit positions 0 through 7 and 40 through 47, an immediate value called I2 in bit positions 8 through 15, a base register called B2 in bit positions 16 through 19, a displacement composed of two parts with the first part called DL1 in bit positions 20 through 31 and the second part called DH1 in bit positions 32 through 39.

[0135] Our long displacement facility computer architecture operates effectively when using new instructions which are created that only use the instruction format with the new 20 bit unsigned displacement.

[0136] A specific embodiment of our computer architecture utilizes existing instructions which have the instruction formats that only have the 12 bit unsigned displacement and are now defined to be in the new instruction formats to have either the existing 12 bit unsigned displacement value when the high order 8 bits of the displacement, field DH, are all zero, or a 20 bit signed value when the high order 8 bits of the displacement, field DH, is non-zero.

[0137] While the preferred embodiment of the invention has been illustrated and described herein, it is to be understood that the invention is not limited to the precise construction herein disclosed, and the right is reserved to all changes and modifications coming within the scope of the invention as defined in the appended claims. 

What is claimed is:
 1. A method of digesting storage of a computing environment, said method comprising: specifying, via an instruction, a unit of storage to be digested; and digesting data in the unit of storage.
 2. The method of claim 1 wherein the specifying comprises providing location information of a data structure associated with the unit of storage.
 3. The method of claim 2 wherein the location information comprises an origin of the data structure.
 4. The method of claim 3 wherein the location information further comprises an index of an entry of the data structure, said entry corresponding to the unit of storage.
 5. The method of claim 1, wherein the digesting data comprises hashing the data in the unit of storage with a secure hash algorithm thereby providing a condensed representation of the data in the unit of storage.
 6. The method of claim 1 wherein the unit of storage comprises one of a segment of storage and a region of storage, and wherein said data structure comprises one of a segment data structure and a region data structure.
 7. The method of claim 1 wherein the digesting data is performed via the instruction.
 8. The method of claim 1 wherein the data structure comprises a plurality of entries, and wherein the digesting data further comprises employing an index to obtain the entry associated with the unit of storage to be digested.
 9. The method of claim 1 wherein the unit of storage comprises a segment of storage, said segment of storage comprising a plurality of pages of storage.
 10. The method of claim 1 wherein the unit of storage comprises a region of storage, said region of storage comprising a plurality of segments of storage, a segment of storage comprising a plurality of pages of storage.
 11. The method of claim 1 wherein the specifying comprises specifying a plurality of units of storage, and the digesting comprises digesting the plurality of units of storage and storing the digested data in a second, smaller unit of storage.
 12. The method of claim 11 wherein the digesting data comprises a chaining operation for digesting the plurality of units of storage.
 13. The method of claim 12 wherein data to be digested are messages, the units of storage are in blocks, and the digesting data comprises processing complete blocks, and after processing all complete blocks, padding the remaining portion of the specified storage.
 14. The method of claim 1 wherein the storage comprises virtual storage.
 15. The method of claim 1 wherein the instruction is implemented in as least one of hardware, firmware and software.
 16. The method of claim 1 wherein the instruction is executed by a processing unit emulating an architecture of the instruction, said architecture of the instruction being different than an architecture of the processing unit.
 17. A system for digesting storage of a computing environment, said method comprising: an instruction specifying a unit of storage to be digested; and a secure hash algorithm function digesting data in the unit of storage.
 18. The system of claim 17 wherein the instruction provides location information of a data structure associated with the unit of storage.
 19. The system of claim 18 wherein the location information comprises an origin of the data structure.
 20. The system of claim 19 wherein the location information further comprises an index of an entry of the data structure, said entry corresponding to the unit of storage.
 21. The system of claim 17, wherein the secure hash algorithm function comprises providing a condensed representation of the data in the unit of storage.
 22. The system of claim 17 wherein the unit of storage comprises one of a segment of storage and a region of storage, and wherein said data structure comprises one of a segment data structure and a region data structure.
 23. The system of claim 17 wherein the digesting data is performed via the instruction.
 24. The system of claim 17 wherein the data structure comprises a plurality of entries, and wherein the secure hash algorithm function further comprises an index to obtain the entry associated with the unit of storage to be digested.
 25. The system of claim 17 wherein the unit of storage comprises a segment of storage, said segment of storage comprising a plurality of pages of storage.
 26. The system of claim 17 wherein the unit of storage comprises a region of storage, said region of storage comprising a plurality of segments of storage, a segment of storage comprising a plurality of pages of storage.
 27. The system of claim 17 wherein the instruction specifies a plurality of units of storage, and the secure hash algorithm function comprises digesting the plurality of units of storage and storing the digested data in a second, smaller unit of storage.
 28. The system of claim 27 wherein the secure hash algorithm function comprises a chaining operation for digesting the plurality of units of storage.
 29. The system of claim 28 wherein data to be digested are messages, the units of storage are in blocks, and the digesting data comprises processing complete blocks, and after processing all complete blocks, padding the remaining portion of the specified storage.
 30. The system of claim 17 wherein the storage comprises virtual storage.
 31. The system of claim 17 further comprises at least one of hardware, firmware and software for implementing the instruction.
 32. The system of claim 17 further comprising a processing unit emulating an architecture of the instruction for executing the instruction, said architecture of the instruction being different than an architecture of the processing unit.
 33. A computer program product comprising: at least one computer usable medium having computer readable program code for performing the method of digesting data in storage of a computing environment, said method comprising: specifying, via an instruction, a unit of storage to be digested; and digesting data in the unit of storage.
 34. The computer program product of claim 33 wherein the specifying comprises providing location information of a data structure associated with the unit of storage.
 35. The computer program product of claim 34 wherein the location information comprises an origin of the data structure.
 36. The computer program product of claim 35 wherein the location information further comprises an index of an entry of the data structure, said entry corresponding to the unit of storage.
 37. The computer program product of claim 36, wherein the digesting data comprises hashing the data in the unit of storage with a secure hash algorithm thereby providing a condensed representation of the data in the unit of storage.
 38. The computer program product of claim 33 wherein the unit of storage comprises one of a segment of storage and a region of storage, and wherein said data structure comprises one of a segment data structure and a region data structure.
 39. The computer program product of claim 33 wherein the data structure comprises a plurality of entries, and wherein the digesting data further comprises employing an index to obtain the entry associated with the unit of storage to be digested.
 40. The computer program product of claim 33 wherein the unit of storage comprises a segment of storage, said segment of storage comprising a plurality of pages of storage.
 41. The computer program product of claim 33 wherein the unit of storage comprises a region of storage, said region of storage comprising a plurality of segments of storage, a segment of storage comprising a plurality of pages of storage.
 42. The computer program product of claim 33 wherein the specifying comprises specifying a plurality of units of storage, and the digesting comprises digesting the plurality of units of storage and storing the digested data in a second, smaller unit of storage.
 43. The computer program product of claim 42 wherein the digesting data comprises a chaining operation for digesting the plurality of units of storage.
 44. The computer program product of claim 43 wherein data to be digested are messages, the units of storage are in blocks, and the digesting data comprises processing complete blocks, and after processing all complete blocks, padding the remaining portion of the specified storage.
 45. The computer program product of claim 33 wherein the computer readable program code comprises program code for execution of the instruction by a processing unit emulating an architecture of the instruction, said architecture of the instruction being different than an architecture of the processing unit. 